Proust: A Nano Proof Assistant
نویسنده
چکیده
Proust is a small Racket program offering rudimentary interactive assistance in the development of verified proofs for propositional and predicate logic. It is constructed in stages, some of which are done by students before using it to complete proof exercises, and in parallel with the study of its theoretical underpinnings, including elements of Martin-Löf type theory. The goal is twofold: to demystify some of the machinery behind full-featured proof assistants such as Coq and Agda, and to better integrate the study of formal logic with other core elements of an undergraduate computer science curriculum.
منابع مشابه
Investigation of the Efficacy of Damp-Proof Montmorillonite Nanoclay for Radon Reduction Strategies in Radon Prone Areas of Ramsar
Background: Ramsar, a northern city in Iran, lies on the coast of the Caspian Sea. This city has areas with some of the highest levels of natural radiation measured to date. The radon concentration in some areas of Ramsar is up to 3700 Bq m–3. On the other hand, due to high level of humidity, damp-proof barriers should be used in construction of new buildings in radon prone areas of this cit...
متن کاملDesign and performance analysis of a seismic grade resonance nano accelerometer
In this paper, design and performance analysis of a resonance nanosensor for earthquake low frequency geoacoustic waves detection is proposed. The model comprises of a proof mass suspended to the substrate, and a nanobeam attached to the intersection of the proof mass to the substrate. The nanobeam could be cosidered as a clamped-clamped nanoresonator actuated electrostartically. The induced ac...
متن کاملNovel Didactic Proof Assistant for First-Order Logic Natural Deduction
We present a proof assistant designed to help learning formal proof, particularly in the system of Natural Deduction for First-Order Logic. The assistant handles formulas and derivations containing metavariables and allows to maintain a library of instanciable lemmas. It possesses a graphical interface presenting proofs as trees and handles multiple simultaneous derivations that can be dragged ...
متن کاملAccurate Summation: Towards a Simpler and Formal Proof
This paper provides a simpler proof of the “accurate summation” algorithm proposed by Demmel and Hida in [1]. It also gives improved bounds in some cases, and examples showing that those new bounds are optimal. This simpler proof will be used to obtain a computer-generated proof of Demmel-Hida’s algorithm, using a proof assistant like HOL, PVS or Coq.
متن کامل